Using carry-truncated addition to analyze add-rotate-xor hash algorithms
نویسندگان
چکیده
منابع مشابه
Using carry-truncated addition to analyze add-rotate-xor hash algorithms
We introduce a truncated addition operation on pairs of N-bit binary numbers that interpolates between ordinary addition mod 2 N and bitwise addition in (Z/2Z) N. We use truncated addition to analyze hash functions that are built from the bit operations add, rotate, and xor, such as Blake, Skein, and Cubehash. Any ARX algorithm can be approximated by replacing ordinary addition with truncated a...
متن کاملCompletion Detecting Carry Select Addition
We present the logic analysis, circuit implementation and verification of a novel selftimed adder scheme based on Carry Select (CS) logic. The preliminary analysis of the variabletime behavior of CS logic justifies the design of self-timed CS adders, and identifies the best choice for the block size to optimize the average performance. Hence we describe the logic design and full-custom circuit ...
متن کاملLow depth carry lookahead addition using charge recycling threshold logic
The main result of this paper is the development of a low depth cany lookahead addition technique based on threshold logic. Two such adders are designed using the recently proposed charge recycling threshold logic gate. The adders are shown to have a very low logic depth, and significantly reduced area and power dissipation compared to other dynamic CMOS implementations.
متن کاملThe Delicate Issues of Addition with Respect to XOR Differences
In this paper we analyze the previous attacks on the block cipher SHACAL-1 and show that all the differential-based attacks fail due to mistreatment of XOR differences through addition. We show that the previously published differential and rectangle attacks on SHACAL-1 fail as some of the underlying differentials are impossible. The relatedkey rectangle attacks on the cipher generally fail, bu...
متن کاملApproximating Addition by XOR: how to go all the way
In this paper, we study approximation of addition by XOR, taking P. Sarkar’s publication [1] as the reference work and starting point. In this work, among various results, it was claimed that explicit formulas seemed difficult to obtain when the number n of summands is more than 5. In the first part of our work, we show a systematic way to find explicit formulas: the complexity to compute them ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2013
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc-2012-0019